On-line selection of an acceptable pair

On-line Selection of an Acceptable Pair

A sequence of objects with independent, identically distributed qualities is presented to a selector who must choose two on-line, i.e. without anticipation or recall. The selector’s aim is to obtain a satisfactory pair as quickly as possible. Two versions of the problem are considered, and optimal selection rules are derived and compared. An investigation is also made of a heuristic rule suitab...

an investigation on influencing factors on tourists shopping attitude of iranian handmade carpet in isfahan

چکیده ندارد.

Forbidden and Acceptable Line Trees

The problem of existence of a tree satisfying a given set of constraints on its vertices is considered. Specifically, given finite set of constraints P = {p1, p2, ..., pn}, we ask if there is an efficient algorithm to build a line-tree T = (V, E) such that for every constraint pi = (ab)(cd), where a, b, c, d are arbitrary elements of V , the path (ab) does not share any vertices with the path (...

an investigation of the impact of self monitoring on langauge teachers motivational practice and its effect on learners motivation

the central purpose of this study was to conduct a case study about the role of self monitoring in teacher’s use of motivational strategies. furthermore it focused on how these strategies affected students’ motivational behavior. although many studies have been done to investigate teachers’ motivational strategies use (cheng & d?rnyei, 2007; d?rnyei & csizer, 1998; green, 2001, guilloteaux & d?...

An optimal algorithm for the on-line dosest pair problem